Alternating coding for universal variable length code
نویسندگان
چکیده
decoding ability as well as immediate error detection and (vLc) is used in a large variety of location ability without performing decoding bi-directionlossless compression applications. A specially designed ally. This improves the decoding throl"&Put without the VLC, called "Universal Variable Length Code" (UVLC), expense of dual decoder structures. The ALT coded UVLC is utilized in the latest video codingstandard H.26L under has a very simple code pattern. This enables an "error In this work we Propose a new coding speculation" to be applied to the ALT coded UVLC packet ~ ~ h $ ~ $ ~ , ~ h ~ which improves its error resiliency and error robustness. yields the Same high as the orig;nal Simulation results show that the ALT coded UVLC almost UVLC, but ALT coding also enables immediate decoding, always yields a data loss of less than 20% when the immediate error detection andlocation in a UVLCpacket. sequence is subjected to errors, whereas the data loss of It improves the error resiliency and error robustness of the the original UVLC can exceed 60%. M ~ ~ ~ ~ ~ ~ ~ , fie simple UVLC packet by applying an "error speculation". Results show ALT coded uvLc always outpercode pattern also enables the simplification of the decoder forms the original UVLC packet in terms of error structure and the design of smaller, faster and low-power iency and robustness. Moreovec the simple pattern of ALT UVLC decoder [I]. coded UVLC can greatly simp113 the UVLC decoder architecture and therefore enables small, fat, and lowpower decoder design. Variable length 2. UVLC AND ITS ERROR RESILIENCY The bi-directionallv decodable UVLC. which from now Coarse Additional IJVLC Value lo be 'Ode 'Ode Codword Length
منابع مشابه
Universal source coding for complementary delivery
This paper deals with a universal coding problem for a certain kind of multiterminal source coding system that we call the complementary delivery coding system. Both fixed-to-fixed length and fixed-to-variable length lossless coding schemes are considered. Explicit constructions of universal codes and bounds of the error probabilities are clarified via type-theoretical and graph-theoretical ana...
متن کاملEfficient Vlsi Implementation of a Vlc Decoder for Golomb-rice Code Using Alternating Coding
Variable length code (VLC) is used in a large variety of lossless compression applications. Golomb-Rice code (GR code) is one type of VLC that is often encountered in the coding of video and image data. In this work we develop an efficient decoder for GR codes. Unlike the conventional variable length decoders, this new type of decoder needs neither codeword tables nor barrel shifters, while the...
متن کاملLZAC Lossless Data Compression
This paper presents LZAC, a new universal lossless data compression algorithm derived from the popular and widely used LZ77 family. The objective of LZAC is to improve the compression ratios of the LZ77 family while still retaining the family’s key characteristics: simple, universal, fast in decoding, and economical in memory consumption. LZAC presents two new ideas: composite fixed-variable-le...
متن کاملUniversal variable-to-fixed length source codes
A universal variable-to-fixed length algorithm for binary memoryless sources which converges to the entropy of the source at the optimal rate is known. We study the problem of universal variable-to-fixed length coding for the class of Markov sources with finite alphabets. We give an upper bound on the performance of the code for large dictionary sizes and show that the code is optimal in the se...
متن کاملQuantum universal variable-length source coding
We construct an optimal quantum universal variable-length code that achieves the admissible minimum rate, i.e., our code is used for any probability distribution of quantum states. Its probability of exceeding the admissible minimum rate exponentially goes to 0. Our code is optimal in the sense of its exponent. In addition, its average error asymptotically tends to 0.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003